An advanced hybrid meta-heuristic algorithm for solving small- and large-scale engineering design optimization problems

نویسندگان

چکیده

Abstract An advanced hybrid algorithm ( h aDEPSO) is proposed in this paper for small- and large-scale engineering design optimization problems. Suggested advanced, differential evolution (aDE) particle swarm (aPSO) integrated with aDEPSO. In aDE a novel, mutation, crossover selection strategy introduced, to avoid premature convergence. And aPSO consists of novel gradually varying parameters, escape stagnation. So, convergence characteristic provides different approximation the solution space. Thus, aDEPSO achieve better solutions due integrating merits aPSO. Also individual population merged other pre-defined manner, balance between global local search capability. The performance its component are validated on 23 unconstrained benchmark functions, then solved five small (structural engineering) one large (economic load dispatch)-scale Outcome analyses confirm superiority algorithms over many state-of-the-art algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

A hybrid meta-heuristic algorithm for solving real-life transportation network design problems

The network-design problem (NDP) has a wide range of applications in transportation, telecommunications, and logistics. The idea is to efficiently design a network of links (roads, optical fibres, etc.) enabling the flow of commodities (drivers, data packets, etc.) to satisfy demand characteristics. Various exact and heuristic methods such as branch and bound, Tabu search, genetic algorithm (GA...

متن کامل

Hybrid Simulated Annealing and Nelder-mead Algorithm for Solving Large-scale Global Optimization Problems

This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

A Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems

This paper presents an effective hybrid coevolutionary particle swarm optimization algorithm for solving constrained engineering design problems, which is based on simulated annealing (SA) , employing the notion of co-evolution to adapt penalty factors. By employing the SAbased selection for the best position of particles and swarms when updating the velocity in co-evolutionary particle swarm o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Electrical Systems and Information Technology

سال: 2021

ISSN: ['2314-7172']

DOI: https://doi.org/10.1186/s43067-021-00032-z